Structured Sparse Method for Hyperspectral Unmixing
نویسندگان
چکیده
Hyperspectral Unmixing (HU) has received increasing attention in the past decades due to its ability of unveiling information latent in hyperspectral data. Unfortunately, most existing methods fail to take advantage of the spatial information in data. To overcome this limitation, we propose a Structured Sparse regularized Nonnegative Matrix Factorization (SS-NMF) method from the following two aspects. First, we incorporate a graph Laplacian to encode the manifold structures embedded in the hyperspectral data space. In this way, the highly similar neighboring pixels can be grouped together. Second, the lasso penalty is employed in SS-NMF for the fact that pixels in the same manifold structure are sparsely mixed by a common set of relevant bases. These two factors act as a new structured sparse constraint. With this constraint, our method can learn a compact space, where highly similar pixels are grouped to share correlated sparse representations. Experiments on real hyperspectral data sets with different noise levels demonstrate that our method outperforms the state-of-the-art methods significantly. Index Terms Hyperspectral Unmixing (HU), Hyperspectral Image Analysis, Structured Sparse NMF (SS-NMF), Mixed Pixel, Nonnegative Matrix Factorization (NMF).
منابع مشابه
تجزیه ی تُنُک تصاویر ابرطیفی با استفاده از یک کتابخانه ی طیفی هرس شده
Spectral unmixing of hyperspectral images is one of the most important research fields in remote sensing. Recently, the direct use of spectral libraries in spectral unmixing is on increase. In this way which is called sparse unmixing, we do not need an endmember extraction algorithm and the number determination of endmembers priori. Since spectral libraries usually contain highly correlated s...
متن کاملA Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications
Unmixing problems in many areas such as hyperspectral imaging and differential optical absorption spectroscopy (DOAS) often require finding sparse nonnegative linear combinations of dictionary elements that match observed data. We show how aspects of these problems, such as misalignment of DOAS references and uncertainty in hyperspectral endmembers, can be modeled by expanding the dictionary wi...
متن کاملجداسازی طیفی و مکانی تصاویر ابرطیفی با استفاده از Semi-NMF و تبدیل PCA
Unmixing of remote-sensing data using nonnegative matrix factorization has been considered recently. To improve performance, additional constraints are added to the cost function. The main challenge is to introduce constraints that lead to better results for unmixing. Correlation between bands of Hyperspectral images is the problem that is paid less attention to it in the unmixing algorithms. I...
متن کاملHyperspectral Image Unmixing: Accounting For Wavelength Dependence∗
We introduce a method for hyperspectral unmixing that incorporates wavelength dependence in addition to spatial dependence. Spatial dependence is incorporated into the model using class labels on the pixels that is assigned using spectral clustering. Wavelength dependence is introduced by correlating the errors in the unmixing regression models. We propose a non-standard alternating direction m...
متن کاملManifold regularization for sparse unmixing of hyperspectral images
BACKGROUND Recently, sparse unmixing has been successfully applied to spectral mixture analysis of remotely sensed hyperspectral images. Based on the assumption that the observed image signatures can be expressed in the form of linear combinations of a number of pure spectral signatures known in advance, unmixing of each mixed pixel in the scene is to find an optimal subset of signatures in a v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1403.4682 شماره
صفحات -
تاریخ انتشار 2014